<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="UTF-8">
  <meta http-equiv="X-UA-Compatible" content="IE=edge">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <title>Document</title>
</head>
<body>
  <script>
    const data = [
  {id:"01", name: "张大大", pid:"", job: "项目经理"},
  {id:"02", name: "小亮", pid:"01", job: "产品leader"},
  {id:"03", name: "小美", pid:"01", job: "UIleader"},
  {id:"04", name: "老马", pid:"01", job: "技术leader"},
  {id:"05", name: "老王", pid:"01", job: "测试leader"},
  {id:"06", name: "老李", pid:"01", job: "运维leader"},
  {id:"07", name: "小丽", pid:"02", job: "产品经理"},
  {id:"08", name: "大光", pid:"02", job: "产品经理"},
  {id:"09", name: "小高", pid:"03", job: "UI设计师"},
  {id:"10", name: "小刘", pid:"04", job: "前端工程师"},
  {id:"11", name: "小华", pid:"04", job: "后端工程师"},
  {id:"12", name: "小李", pid:"04", job: "后端工程师"},
  {id:"13", name: "小赵", pid:"05", job: "测试工程师"},
  {id:"14", name: "小强", pid:"05", job: "测试工程师"},
  {id:"15", name: "小涛", pid:"06", job: "运维工程师"}
]
function arrToTree (list,pidd){
  // 定义一个需要存放的树行结构的数据
const treeData = []
// 先遍历
list.forEach( item =>{
  // 判断item的pid是否为空值
  if(item.pid === pidd) {
    // 如果是空那么他就是顶级 
    // 继续往下排查  看下面的pid和顶级的id值是否相等  是就为顶级的儿类
    const children = arrToTree(list,item.id)
    // 查看children是否存在子级
    if(children.length){
      item.children=children
    }
    treeData.push(item)
  }

})
return treeData

}
 const treeData = arrToTree(data,'')
 console.log(treeData);
  </script>
</body>
</html>